Rational equivalence of unimodular circulants
نویسندگان
چکیده
منابع مشابه
Unimodular integer circulants
We study families of integer circulant matrices and methods for determining which are unimodular. This problem arises in the study of cyclically presented groups, and leads to the following problem concerning polynomials with integer coefficients: given a polynomial f(x) ∈ Z[x], determine all those n ∈ N such that Res(f(x), xn − 1) = ±1. In this paper we describe methods for resolving this prob...
متن کاملCanonical rational equivalence of intersections of divisors
We consider the operation of intersecting with a locally principal Cartier divisor (i.e., a Cartier divisor which is principal on some neighborhood of its support). We describe this operation explicitly on the level of cycles and rational equivalences and as a corollary obtain a formula for rational equivalence between intersections of two locally principal Cartier divisors. Such canonical rati...
متن کاملOn behavioral equivalence of rational representations
This article deals with the equivalence of representations of behaviors of linear differential systems. In general, the behavior of a given linear differential system has many different representations. In this paper we restrict ourselves to kernel representations and image representations. Two kernel representations or image representations are called equivalent if they represent one and the s...
متن کاملPieri’s Formula via Explicit Rational Equivalence
Pieri’s formula describes the intersection product of a Schubert cycle by a special Schubert cycle on a Grassmannian. Classically, it is proven by calculating an appropriate triple intersection of Schubert varieties. We present a new geometric proof, exhibiting an explicit chain of rational equivalences from a suitable sum of distinct Schubert varieties to the intersection of a Schubert variety...
متن کاملLine Graphs and Circulants
The line graph of G, denoted L(G), is the graph with vertex set E(G), where vertices x and y are adjacent in L(G) iff edges x and y share a common vertex in G. In this paper, we determine all graphs G for which L(G) is a circulant graph. We will prove that if L(G) is a circulant, then G must be one of three graphs: the complete graph K4, the cycle Cn, or the complete bipartite graph Ka,b, for s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences
سال: 1974
ISSN: 0098-8979
DOI: 10.6028/jres.078b.008